Coxeter group

In mathematics, a Coxeter group, named after H.S.M. Coxeter, is an abstract group that admits a formal description in terms of mirror symmetries. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced (Coxeter 1934) as abstractions of reflection groups, and finite Coxeter groups were classified in (Coxeter 1935).

Coxeter groups find applications in many areas of mathematics. Examples of finite Coxeter groups include the symmetry groups of regular polytopes, and the Weyl groups of simple Lie algebras. Examples of infinite Coxeter groups include the triangle groups corresponding to regular tessellations of the Euclidean plane and the hyperbolic plane, and the Weyl groups of infinite-dimensional Kac–Moody algebras.

Standard references include (Humphreys 1990) and (Davis 2007).

1 Definition
2 An example
3 Connection with reflection groups
4 Finite Coxeter groups
5 Affine Coxeter groups
6 Hyperbolic Coxeter groups
7 Partial orders
8 Homology
9 See also
10 References
11 Further reading
12 External links

Definition

Formally, a Coxeter group can be defined as a group with the presentation

$\left\langle r_1,r_2,\ldots,r_n \mid (r_ir_j)^{m_{ij}}=1\right\rangle$

where $m_{ii}=1$ and $m_{ij}\geq 2$ for $i\neq j$ . The condition $m_{i j}= \infty$ means no relation of the form $(r_i r_j)^m$ should be imposed.

The pair (W,S) where W is a Coxeter group with generators S={r₁,...,r_n} is called Coxeter system. Note that in general S is not uniquely determined by W. For example, the Coxeter groups of type BC₃ and A₁xA₃ are isomorphic but the Coxeter systems are not equivalent (see below for an explanation of this notation).

A number of conclusions can be drawn immediately from the above definition.

The relation m_{i i} = 1 means that (r_ir_i )¹ = (r_i )² = 1 for all i ; the generators are involutions.
If m_{i j} = 2, then the generators r_i and r_j commute. This follows by observing that

xx = yy = 1,

together with

xyxy = 1

implies that

xy = x(xyxy)y = (xx)yx(yy) = yx.

Alternatively, since the generators are involutions, $r_i = r_i^{-1}$ , so $(r_ir_j)^2=r_ir_jr_ir_j=r_ir_jr_i^{-1}r_j^{-1}$ , and thus is equal to the commutator.

In order to avoid redundancy among the relations, it is necessary to assume that m_{i j} = m_{j i}. This follows by observing that

yy = 1,

together with

(xy)^m = 1

implies that

(yx)^m = (yx)^myy = y(xy)^my = yy = 1.

Alternatively, $(xy)^m$ and $(yx)^m$ are conjugate elements, as $y(xy)^m y^{-1} = (yx)^m yy^{-1}=(yx)^m$ .

The Coxeter matrix is the n×n, symmetric matrix with entries m_{i j}. Indeed, every symmetric matrix with positive integer and ∞ entries and with 1's on the diagonal such that all nondiagonal entries are greater than 1 serves to define a Coxeter group. The Coxeter matrix can be conveniently encoded by a Coxeter graph, as per the following rules.

The vertices of the graph are labelled by generator subscripts.
Vertices i and j are connected if and only if m_{i j} ≥ 3.
An edge is labelled with the value of m_{i j} whenever it is 4 or greater.

In particular, two generators commute if and only if they are not connected by an edge. Furthermore, if a Coxeter graph has two or more connected components, the associated group is the direct product of the groups associated to the individual components. Thus the disjoint union of Coxeter graphs yields a direct product of Coxeter groups.

An example

The graph in which vertices 1 through n are placed in a row with each vertex connected by an unlabelled edge to its immediate neighbors gives rise to the symmetric group S_n+1; the generators correspond to the transpositions (1 2), (2 3), ... (n n+1). Two non-consecutive transpositions always commute, while (k k+1) (k+1 k+2) gives the 3-cycle (k k+2 k+1). Of course this only shows that S_n+1 is a quotient group of the Coxeter group described by the graph, but it is not too difficult to check that equality holds.

Connection with reflection groups

For more details on this topic, see Reflection group.

Coxeter groups are deeply connected with reflection groups. Simply put, Coxeter groups are abstract groups (given via a presentation), while reflection groups are concrete groups (given as subgroups of linear groups or various generalizations). Coxeter groups grew out of the study of reflection groups — they are an abstraction: a reflection group is a subgroup of a linear group generated by reflections (which have order 2), while a Coxeter group is an abstract group generated by involutions (elements of order 2, abstracting from reflections), and whose relations have a certain form ( $(r_ir_j)^k$ , corresponding to hyperplanes meeting at an angle of $\pi/k$ , with $r_ir_j$ being of order k abstracting from a rotation by $2\pi/k$ ).

The abstract group of a reflection group is a Coxeter group, while conversely a reflection group can be seen as a linear representation of a Coxeter group. For finite reflection groups, this yields an exact correspondence: every finite Coxeter group admits a faithful representation as a finite reflection group of some Euclidean space. For infinite Coxeter groups, however, a Coxeter group may not admit a representation as a reflection group.

Historically, (Coxeter 1934) proved that every reflection group is a Coxeter group (i.e., has a presentation where all relations are of the form $r_i^2$ or $(r_ir_j)^k$ ), and indeed this paper introduced the notion of a Coxeter group, while (Coxeter 1935) proved that every finite Coxeter group had a representation as a reflection group, and classified finite Coxeter groups.

Finite Coxeter groups

Classification

The finite Coxeter groups were classified in (Coxeter 1935), in terms of Coxeter–Dynkin diagrams; they are all represented by reflection groups of finite-dimensional Euclidean spaces.

The finite Coxeter groups consist of three one-parameter families of increasing rank $A_n, BC_n, D_n,$ one one-parameter family of dimension two, $I_2(p),$ and six exceptional groups: $E_6, E_7, E_8, F_4, H_3,$ and $H_4.$

Weyl groups

Main article: Weyl group

Many, but not all of these, are Weyl groups, and every Weyl group can be realized as a Coxeter group. The Weyl groups are the families $A_n, BC_n,$ and $D_n,$ and the exceptions $E_6, E_7, E_8, F_4,$ and $I_2(6),$ denoted in Weyl group notation as $G_2.$ The non-Weyl groups are the exceptions $H_3$ and $H_4,$ and the family $I_2(p)$ except where this coincides with one of the Weyl groups (namely $I_2(3) \cong A_2, I_2(4) \cong BC_2,$ and $I_2(6) \cong G_2$ ).

This can be proven by comparing the restrictions on (undirected) Dynkin diagrams with the restrictions on Coxeter diagrams of finite groups: formally, the Coxeter graph can be obtained from the Dynkin diagram by discarding the direction of the edges, and replacing every double edge with an edge labelled 4 and every triple edge by an edge labelled 6. Also note that every finitely generated Coxeter group is an Automatic group.^[1] Dynkin diagrams have the additional restriction that the only permitted edge labels are 2, 3, 4, and 6, which yields the above. Geometrically, this corresponds to the crystallographic restriction theorem, and the fact that excluded polytopes do not fill space or tile the plane – for $H_3,$ the dodecahedron (dually, icosahedron) does not fill space; for $H_4,$ the 120-cell (dually, 600-cell) does not fill space; for $I_2(p)$ a p-gon does not tile the plane except for $p=3, 4,$ or 6 (the triangular, square, and hexagonal tilings, respectively).

Note further that the (directed) Dynkin diagrams B_n and C_n give rise to the same Weyl group (hence Coxeter group), because they differ as directed graphs, but agree as undirected graphs – direction matters for root systems but not for the Weyl group; this corresponds to the hypercube and cross-polytope being different regular polytopes but having the same symmetry group.

Properties

Some properties of the finite Coxeter groups are given in the following table:

Group symbol	Alternate symbol	Bracket notation	Rank	Order	Related polytopes	Coxeter-Dynkin diagram
A_n	A_n	[3^n-1]	n	(n + 1)!	n-simplex	..
BC_n	C_n	[4,3^n-2]	n	2ⁿ n!	n-hypercube / n-cross-polytope	...
D_n	B_n	[3^n-3,1,1]	n	2ⁿ⁻¹ n!	n-demihypercube	...
E₆	E₆	[3^2,2,1]	6	72x6! = 51840	2₂₁, 1₂₂
E₇	E₇	[3^3,2,1]	7	72x8! = 2903040	3₂₁, 2₃₁, 1₃₂
E₈	E₈	[3^4,2,1]	8	192x10! = 696729600	4₂₁, 2₄₁, 1₄₂
F₄	F₄	[3,4,3]	4	1152	24-cell
G₂	-	[6]	2	12	hexagon
H₂	G₂	[5]	2	10	pentagon
H₃	G₃	[3,5]	3	120	icosahedron / dodecahedron
H₄	G₄	[3,3,5]	4	14400	120-cell / 600-cell
I₂(p)	D₂^p	[p]	2	2p	p-gon

Symmetry groups of regular polytopes

All symmetry groups of regular polytopes are finite Coxeter groups. Note that dual polytopes have the same symmetry group.

There are three series of regular polytopes in all dimensions. The symmetry group of a regular n-simplex is the symmetric group S_n+1, also known as the Coxeter group of type A_n. The symmetry group of the n-cube and its dual, the n-cross-polytope is BC_n, and is known as the hyperoctahedral group.

The exceptional regular polytopes in dimensions two, three, and four, correspond to other Coxeter groups. In two dimensions, the dihedral groups, which are the symmetry groups of regular polygons, form the series I₂(p). In three dimensions, the symmetry group of the regular dodecahedron and its dual, the regular icosahedron, is H₃, known as the full icosahedral group. In four dimensions, there are three special regular polytopes, the 24-cell, the 120-cell, and the 600-cell. The first has symmetry group F₄, while the other two are dual and have symmetry group H₄.

The Coxeter groups of type D_n, E₆, E₇, and E₈ are the symmetry groups of certain semiregular polytopes.

Table of polytope families

Group

A_n

BC_n

D_n

E₆

E₇

E₈

F₄

G₂

H_n

I_n(p)

(Triangle)

Square

Hexagon

Pentagon

p-gon

Tetrahedron

Cube

Octahedron

Tetrahedron

Dodecahedron

Icosahedron

5-cell

Tesseract

16-cell

Demitesseract

24-cell

120-cell

600-cell

5-simplex

5-cube

5-orthoplex

5-demicube

6-simplex

6-cube

6-orthoplex

6-demicube

1₂₂

2₂₁

7-simplex

7-cube

7-orthoplex

7-demicube

1₃₂

2₃₁

3₂₁

8-simplex

8-cube

8-orthoplex

8-demicube

1₄₂

2₄₁

4₂₁

9-simplex

9-cube

9-orthoplex

9-demicube

10-simplex

10-cube

10-orthoplex

10-demicube

Family
n

n-simplex

n-hypercube

n-orthoplex

n-demicube

1_k2

2_k1

k₂₁

Affine Coxeter groups

Group symbol	Witt symbol	Bracket notation	Related uniform tessellation(s)	Coxeter-Dynkin diagram
${\tilde{A}}_n$	P_n+1	[3^[n+1]]	Simplectic honeycomb ${\tilde{A}}_2$ :Triangular tiling ${\tilde{A}}_3$ :Tetrahedral-octahedral honeycomb	... or ...
${\tilde{B}}_n$	S_n+1	[4,3^n-2,3^1,1]	Demihypercubic honeycomb	...
${\tilde{C}}_n$	R_n+1	[4,3^n-1,4]	Hypercubic honeycomb	...
${\tilde{D}}_n$	Q_n+1	[ 3^1,1,3^n-3,3^1,1]	Demihypercubic honeycomb	...
${\tilde{E}}_6$	T₇	[3^2,2,2]	2₂₂
${\tilde{E}}_7$	T₈	[3^3,3,1]	3₃₁, 1₃₃
${\tilde{E}}_8$	T₉	[3^5,2,1]	5₂₁, 2₅₁, 1₅₂
${\tilde{F}}_4$	U₅	[3,4,3,3]	16-cell honeycomb 24-cell honeycomb
${\tilde{G}}_2$	V₃	[6,3]	Hexagonal tiling and Triangular tiling
${\tilde{I}}_1$	W₂	[∞]	apeirogon

Hyperbolic Coxeter groups

There are infinitely many hyperbolic Coxeter groups describing reflection groups in hyperbolic space, notably including the hyperbolic triangle groups.

Partial orders

A choice of reflection generators gives rise to a length function l on a Coxeter group, namely the minimum number of uses of generators required to express a group element; this is precisely the length in the word metric in the Cayley graph. An expression for v using l(v) generators is a reduced word. For example, the permutation (13) in S₃ has two reduced words, (12)(23)(12) and (23)(12)(23). The function $v \to (-1)^{l(v)}$ defines a map $G \to \{\pm 1\},$ generalizing the sign map for the symmetric group.

Using reduced words one may define three partial orders on the Coxeter group, the (left) weak order, the absolute order and the Bruhat order (named for François Bruhat). An element v exceeds an element u in the Bruhat order if some (or equivalently, any) reduced word for v contains a reduced word for u as a substring, where some letters (in any position) are dropped. In the weak order, v ≥ u if some reduced word for v contains a reduced word for u as an initial segment. Indeed, the word length makes this into a graded poset. The Hasse diagrams corresponding to these orders are objects of study, and are related to the Cayley graph determined by the generators. The absolute order is defined analogously to the weak order, but with generating set/alphabet consisting of all conjugates of the Coxeter generators.

For example, the permutation (1 2 3) in S₃ has only one reduced word, (12)(23), so covers (12) and (23) in the Bruhat order but only covers (12) in the weak order.

Homology

Since a Coxeter group W is generated by finitely many elements of order 2, its abelianization is an elementary abelian 2-group, i.e. it is isomorphic to the direct sum of several copies of the cyclic group Z₂. This may be restated in terms of the first homology group of W.

The Schur multiplier M(W) (related to the second homology) was computed in (Ihara & Yokonuma 1965) for finite reflection groups and in (Yokonuma 1965) for affine reflection groups, with a more unified account given in (Howlett 1988). In all cases, the Schur multiplier is also an elementary abelian 2-group. For each infinite family {W_n} of finite or affine Weyl groups, the rank of M(W) stabilizes as n goes to infinity.

References

^ Brink and Howlett (1993), "A finiteness property and an automatic structure for Coxeter groups", Mathematische Annalen (Springer Berlin / Heidelberg), ISSN 0025-5831.

External links

Weisstein, Eric W., "Coxeter group" from MathWorld.
Jenn software for visualizing the Cayley graphs of finite Coxeter groups on up to four generators, http://www.jenn3d.org/index.html